2 - distance ( ∆ + 2 ) - coloring of planar graphs with girth six and ∆ ≥ 18
نویسندگان
چکیده
It was proved in [Z. Dvořàk, D. Kràl, P. Nejedlỳ, R. Škrekovski, Coloring squares of planar graphs with girth six, European J. Combin. 29 (4) (2008) 838–849] that every planar graph with girth g ≥ 6 and maximum degree ∆ ≥ 8821 is 2-distance (∆ + 2)-colorable. We prove that every planar graph with g ≥ 6 and∆ ≥ 18 is 2-distance (∆+ 2)-colorable. © 2009 Elsevier B.V. All rights reserved.
منابع مشابه
Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable
For graphs of bounded maximum average degree, we consider the problem of 2-distance coloring. This is the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbor receive different colors. It is already known that planar graphs of girth at least 6 and of maximum degree∆ are list 2-distance (∆ + 2)-colorable when ∆ ≥ 24 (Borodin and Ivanova (2...
متن کامل2-distance 4-colorability of Planar Subcubic Graphs with Girth at Least 22
The trivial lower bound for the 2-distance chromatic number χ2(G) of any graph G with maximum degree ∆ is ∆+1. It is known that χ2 = ∆+1 if the girth g of G is at least 7 and ∆ is large enough. There are graphs with arbitrarily large ∆ and g ≤ 6 having χ2(G) ≥ ∆ + 2. We prove the 2-distance 4-colorability of planar subcubic graphs with g ≥ 22.
متن کاملList-Coloring Squares of Sparse Subcubic Graphs
The problem of colouring the square of a graph naturally arises in connection with the distance labelings, which have been studied intensively. We consider this problem for sparse subcubic graphs and show that the choosability χ`(G 2) of the square of a subcubic graph G of maximum average degree d is at most four if d < 24/11 and G does not contain a 5-cycle, χ`(G 2) is at most five if d < 7/3 ...
متن کاملAdjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge-coloring of G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing edge-coloring of G is denoted by χ a (G). We prove that χ a (G) is at most the maximum degree plus 2 if G is a planar graph without isolated edges w...
متن کاملList-colouring Squares of Sparse Subcubic Graphs
The problem of colouring the square of a graph naturally arises in connection with the distance labelings, which have been studied intensively. We consider this problem for sparse subcubic graphs. We show that the choosability χ (G2) of the square of a subcubic graph G of maximum average degree d is at most four if d < 24/11 and G does not contain a 5-cycle, χ (G2) is at most five if d < 7/3 an...
متن کامل